Solvers:

• Combinatorial Methods:

  • Integer Linear Programming
  • Multicut
  • Multiway Cut
  • A-star branch-and-bound search
  • Reduced Inference
  • BruteForce
  • CombiLP
  • DAOOPT

• Linear Programming Relaxations:

  • Dual Decomposition with Bundle
  • Dual Decomposition with Subgradients
  • Sequntial Tree-reweighted Message Passing
  • Adaptive Diminishing Smoothing ALgorithm
  • Quadratic Pseudo Boolean Optimization
  • MQPBO
  • Multiway Cut Relaxations
  • Linear Programming Relaxations over the Local Polytope
  • AD3
  • MPLP
  • GraphCut:
  • Boost Max Flow
  • IBFS
  • Kolmogorovs algorithm

• Message Passing Methods :

  • Dynamic Programming on acyclic graphs
  • Loopy Belief Propagation
  • Sequential Belief Propagation
  • Tree-reweighted Belief Propagation

• Move Making Methods :

  • Lazy Flipper
  • Inf and Flip
  • Iterated Conditional Modes
  • FastPD
  • Alpha-Expansion
  • Alpha-Beta-Swap
  • Alpha-Fusion
  • Kerninghan Lin Algorithm
  • LOC